Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities
Identifieur interne : 000430 ( Main/Exploration ); précédent : 000429; suivant : 000431Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities
Auteurs : Gerhard Weikum [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
English descriptors
- Teeft :
- Aggregated, Aggregation, Aggregation queries, Algorithm, Algorithmic building blocks, Autonomous peers, Bird watchers, Business model, Business models, Centralized anything, Centralized data centers, Centralized search engine, Clickthrough fraud, Collection selection, Data centers, Data item, Data items, Decentralized, Decentralized algorithm, Different peers, Epidemic dissemination, Expander graph, Future opportunities, Global, Hash, Hash sketches, Hash tables, Heidelberg, High dynamics, High probability, Index lists, Individual peers, Information retrieval, Internet, Inverted list, Inverted lists, Klee family, Large user community, Last decade, Link analyses, Link analysis, Many peers, Many users, Multiple peers, Network size, Other forms, Other hand, Other peers, Overall content, Overlay, Overlay network, Pagerank, Peer, Peer failures, Personal data, Privacy concerns, Provider, Query, Query processing, Random graphs, Range queries, Result candidates, Retrieval, Scalable, Search engine, Search engines, Search network, Search results, Semantic overlay networks, Small number, Social networks, Spectral analysis, Statistical computations, Successful systems, Syst, Target peers, Total number, Unstructured overlay, User, Various forms, Various kinds, Various reasons, Weikum.
Abstract
Abstract: The peer-to-peer (P2P) computing paradigm has been very successful like file sharing in Internet-wide communities (e.g., Gnutella, BitTorrent) or IP telephony (e.g., Skype). P2P systems promise perfect scalability from few peers to many millions, and resilience to failures, dynamic variability, and even misbehaving peers with egoistic or even malicious behavior. None of these salient properties requires any global planning, administration, or control; so P2P systems are completely self-organizing. Web search seems to be a perfect match for P2P architectures. The Web has naturally distributed data, spread across the entire Internet, as opposed to artifically hosting all content by a centralized search engine. For user-provided contents in Web 2.0 communities, consideration of the content ownership, the autonomy of users, and the individualized control of privacy would also suggest decentralized solutions with many peers. Using the combined power and knowledge of millions of users and their computers could offer a more informative and pluralistic view of the world’s information. A P2P search engine could benefit from the intellectual input – bookmarks, queries, clicks – of a large user community, without undue risks about privacy or censorship, because users can gather logs on their own computers and control further sharing and aggregation by their individual policies. These potential benefits have motivated a wealth of exciting research on algorithms and systems for P2P Web search. This paper gives a brief overview on the last decade’s research achievements along these lines. Despite all these intriguing promises and notwithstanding the impressive success of simpler file-sharing applications, P2P approaches to Web search or Web 2.0 services did not make a significant impact on the practical deployment side. The wave of P2P euphoria in academic research was followed by a phase of disillusionment about the lack of business models and user incentives. This paper discusses these shortcomings, and points out new opportunities for the P2P paradigm to play a more successful role in future Web applications.
Url:
DOI: 10.1007/978-3-642-17226-7_12
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000074
- to stream Istex, to step Curation: 000072
- to stream Istex, to step Checkpoint: 000283
- to stream Main, to step Merge: 000430
- to stream Main, to step Curation: 000430
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title>
<author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76</idno>
<date when="2010" year="2010">2010</date>
<idno type="doi">10.1007/978-3-642-17226-7_12</idno>
<idno type="url">https://api.istex.fr/document/0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000074</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000074</idno>
<idno type="wicri:Area/Istex/Curation">000072</idno>
<idno type="wicri:Area/Istex/Checkpoint">000283</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000283</idno>
<idno type="wicri:doubleKey">0302-9743:2010:Weikum G:peer:to:peer</idno>
<idno type="wicri:Area/Main/Merge">000430</idno>
<idno type="wicri:Area/Main/Curation">000430</idno>
<idno type="wicri:Area/Main/Exploration">000430</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities</title>
<author><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Max-Planck Institute for Informatics, Saarbruecken</wicri:regionArea>
<wicri:noRegion>Saarbruecken</wicri:noRegion>
<wicri:noRegion>Saarbruecken</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2010</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Aggregated</term>
<term>Aggregation</term>
<term>Aggregation queries</term>
<term>Algorithm</term>
<term>Algorithmic building blocks</term>
<term>Autonomous peers</term>
<term>Bird watchers</term>
<term>Business model</term>
<term>Business models</term>
<term>Centralized anything</term>
<term>Centralized data centers</term>
<term>Centralized search engine</term>
<term>Clickthrough fraud</term>
<term>Collection selection</term>
<term>Data centers</term>
<term>Data item</term>
<term>Data items</term>
<term>Decentralized</term>
<term>Decentralized algorithm</term>
<term>Different peers</term>
<term>Epidemic dissemination</term>
<term>Expander graph</term>
<term>Future opportunities</term>
<term>Global</term>
<term>Hash</term>
<term>Hash sketches</term>
<term>Hash tables</term>
<term>Heidelberg</term>
<term>High dynamics</term>
<term>High probability</term>
<term>Index lists</term>
<term>Individual peers</term>
<term>Information retrieval</term>
<term>Internet</term>
<term>Inverted list</term>
<term>Inverted lists</term>
<term>Klee family</term>
<term>Large user community</term>
<term>Last decade</term>
<term>Link analyses</term>
<term>Link analysis</term>
<term>Many peers</term>
<term>Many users</term>
<term>Multiple peers</term>
<term>Network size</term>
<term>Other forms</term>
<term>Other hand</term>
<term>Other peers</term>
<term>Overall content</term>
<term>Overlay</term>
<term>Overlay network</term>
<term>Pagerank</term>
<term>Peer</term>
<term>Peer failures</term>
<term>Personal data</term>
<term>Privacy concerns</term>
<term>Provider</term>
<term>Query</term>
<term>Query processing</term>
<term>Random graphs</term>
<term>Range queries</term>
<term>Result candidates</term>
<term>Retrieval</term>
<term>Scalable</term>
<term>Search engine</term>
<term>Search engines</term>
<term>Search network</term>
<term>Search results</term>
<term>Semantic overlay networks</term>
<term>Small number</term>
<term>Social networks</term>
<term>Spectral analysis</term>
<term>Statistical computations</term>
<term>Successful systems</term>
<term>Syst</term>
<term>Target peers</term>
<term>Total number</term>
<term>Unstructured overlay</term>
<term>User</term>
<term>Various forms</term>
<term>Various kinds</term>
<term>Various reasons</term>
<term>Weikum</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: The peer-to-peer (P2P) computing paradigm has been very successful like file sharing in Internet-wide communities (e.g., Gnutella, BitTorrent) or IP telephony (e.g., Skype). P2P systems promise perfect scalability from few peers to many millions, and resilience to failures, dynamic variability, and even misbehaving peers with egoistic or even malicious behavior. None of these salient properties requires any global planning, administration, or control; so P2P systems are completely self-organizing. Web search seems to be a perfect match for P2P architectures. The Web has naturally distributed data, spread across the entire Internet, as opposed to artifically hosting all content by a centralized search engine. For user-provided contents in Web 2.0 communities, consideration of the content ownership, the autonomy of users, and the individualized control of privacy would also suggest decentralized solutions with many peers. Using the combined power and knowledge of millions of users and their computers could offer a more informative and pluralistic view of the world’s information. A P2P search engine could benefit from the intellectual input – bookmarks, queries, clicks – of a large user community, without undue risks about privacy or censorship, because users can gather logs on their own computers and control further sharing and aggregation by their individual policies. These potential benefits have motivated a wealth of exciting research on algorithms and systems for P2P Web search. This paper gives a brief overview on the last decade’s research achievements along these lines. Despite all these intriguing promises and notwithstanding the impressive success of simpler file-sharing applications, P2P approaches to Web search or Web 2.0 services did not make a significant impact on the practical deployment side. The wave of P2P euphoria in academic research was followed by a phase of disillusionment about the lack of business models and user incentives. This paper discusses these shortcomings, and points out new opportunities for the P2P paradigm to play a more successful role in future Web applications.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
</country>
</list>
<tree><country name="Allemagne"><noRegion><name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name>
</noRegion>
<name sortKey="Weikum, Gerhard" sort="Weikum, Gerhard" uniqKey="Weikum G" first="Gerhard" last="Weikum">Gerhard Weikum</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000430 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000430 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Sarre |area= MusicSarreV3 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:0705CDAE9684CEAFD84EF3DACDE09C8298A9FA76 |texte= Peer-to-Peer Web Search: Euphoria, Achievements, Disillusionment, and Future Opportunities }}
This area was generated with Dilib version V0.6.33. |